Looking for Simple Common Schemes to Design Recognizer P Systems with Active Membranes That Solve Numerical Decision Problems

Earlier solutions to decision problems by means of P systems used many counter objects to control the synchronization of different stages in a computation (usually as many counters as the stage must last in the worst case). In this paper we propose a way to replace those counters with some spacial objects for each stage. Furthermore, following the ideas presented in [1], in order to have a common scheme to attack numerical problems, all instances of a problem with the same size are solved by the same P system (which depends on the size) given an input which describes the corresponding instance of the problem. We illustrate these ideas with a cellular solution to the Subset-Sum problem

A New Strategy to Improve the Performance of PDP-Systems Simulators

One of the major challenges that current P systems simulators have to deal with is to be as efficient as possible. A P system is syntactically described as a membrane structure delimiting regions where multisets of objects evolve by means of evolution rules. According to that, on each computation step, the applicability of the rules for the current P system configuration must be calculated. In this paper we extend previous works that use Rete-based simulation algorithm in order to improve the time consumed during the checking phase in the selection of rules. A new approach is presented, oriented to the acceleration of Population Dynamics P Systems simulations.Ministerio de Economía y Competitividad TIN2012- 3743

Rete Algorithm for P System Simulators

The Rete algorithm is a well-known algorithm in rule-based production systems which builds directed acyclic graphs that represent higher-level rule sets. This allows the rule-based systems to avoid complete re-evaluation of all conditions of the rules each step in order to check the applicability of the rules and, therefore, the computational e ciency of the production systems is improved. In this paper we study how these ideas can be applied in the improvement of the design of computational simulators in the framework of Membrane Computing.Junta de Andalucía P08-TIC-04200Ministerio de Economía y Competitividad TIN2012-3743

Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment

The aim ofthis paper is to develop an executable prototype ofan unconventional model ofcomputation. Using the PVS verification system (an interactive environment for writing formal specifications and checking formal proofs), we formalize the restricted model, based on DNA, due to L. Adleman. Also, we design a formal molecular program in this model that solves SAT following Lipton’s ideas.We prove using PVS the soundness and completeness ofthis molecular program. This work is intended to give an approach to the opportunities offered by mechanized analysis ofuncon ventional model ofcomputation in general. This approach opens up new possibilities ofv erifying molecular experiments before implementing them in a laboratory.Ministerio de Educación y Cultura TIC2000-1368-C03-02Ministerio de Educación y Cultura PB96-134

A Membrane Computing Model for Ballistic Depositions

Ballistic Deposition was proposed by Vold and Sutherland as a model for colloidal aggregation. These early works were later extended to simulate the process of vapor deposition. In general, Ballistic Deposition models involve (d + 1)-dimensional particles which rain down sequentially at random onto a d-dimensional substrate; when a particle arrives on the existing agglomeration of deposited particles, it sticks to the rst particle it contacts, which may result in lateral growth. In this paper we present a rst P system model for Ballistic Deposition with d = 1.Ministerio de Educación y Ciencia TIN2006-13425Junta de Andalucía TIC-58

Fuzzy reasoning spiking neural P systems revisited: A formalization

Research interest within membrane computing is becoming increasingly interdisciplinary.In particular, one of the latest applications is fault diagnosis. The underlying mechanismwas conceived by bridging spiking neural P systems with fuzzy rule-based reasoning systems. Despite having a number of publications associated with it, this research line stilllacks a proper formalization of the foundations.National Natural Science Foundation of China No 61320106005National Natural Science Foundation of China No 6147232

Matemáticas para la verificación de programas

En este trabajo presentamos las directrices de la formación postgrado sobre verificación formal de programas en el Departamento de Ciencias de la Computación e Inteligencia Artificial de la Universidad de Sevilla. Los cursos en los que se articula dicha formación representan realmente una adaptación curricular, tanto para matemáticos como para informáticos, para el programa de doctorado del citado departamento en la Universidad de Sevilla. Su contenido pretende solventar el déficit lógico-matemático de los alumnos de Ingeniería Informática así como las carencias en lógica aplicada a la programación de los alumnos que provienen de la licenciatura de Matemáticas. En el caso que nos ocupa, relacionamos los conceptos lógicos de adecuación y completitud de teorías lógicas con los correspondientes sobre sistemas de verificación de programas.Parcialmente financiado por el proyecto de innovación: Un programa de adaptación curricular en el área de Ciencias de la Computación e Inteligencia Artificial (ICE de la Universidad de Sevilla), y por el proyecto DGES PB96-1345 del Ministerio de Educación y Cultura

Revisiting Sevilla Carpets: A New Tool for the P-Lingua Era

Sevilla Carpets have already been used to compare di erent solutions of the Subset Sum problem: either designed in the framework of P systems with active membranes (both in the case of membrane division and membrane creation), and also another one in the framework of tissue-like P systems with cell division. Recently, the degree of parallelism and other descriptive complexity details have been found to be relevant when designing parallel simulators running on GPUs. We present here a new way to use the information provided by Sevilla carpets, and a script that allows to generate them automatically from P-Lingua les.Ministerio de Economía y Competitividad TIN2012-3743

DCBA: Simulating Population Dynamics P Systems with Proportional Object Distribution

Population Dynamics P systems refer to a formal framework for ecological modelling. The semantics of the model associates probabilities to rules, but at the same time, the model is based on P systems, so the rules are applied in a maximally parallel way. Since the success of the rst model using this framework [5], initially called multienvironment probabilistic P systems, several simulation algorithms have been de ned in order to better reproduce the behaviour of the ecosystems with the models. BBB and DNDP are previous attempts, which de ne blocks of rules having the same left-hand side, but do not de ne a deterministic behaviour when di erent rules are competing for the same resources. That is, di erent blocks of rules present in their lefthand side common objects, being applicable at the same time. In this paper, we introduce a new simulation algorithm, called DCBA, which performs a proportional distribution of resources.Junta de Andalucía P08-TIC04200Ministerio de Educación y Ciencia TIN2009-1319